Efficient Inter-Geodesic Distance Computation and Fast Classical Scaling
نویسندگان
چکیده
منابع مشابه
Fast Classical Scaling
Multidimensional-scaling (MDS) is a dimensionality reduction tool used for information analysis, data visualization and manifold learning. Most MDS procedures find embedding of data points in low dimensional Euclidean (flat) domains, such that distances between the points are as close as possible to given interpoints dissimilarities. We present an efficient solver for Classical Scaling, a speci...
متن کاملFast geodesic distance approximation using mesh decimation and front propagation
Polygon meshes are collections of vertices, edges and faces defining surfaces in a 3D environment. Computing geometric features on a polygon mesh is of major interest for various applications. Among these features, the geodesic distance is the distance between two vertices following the surface defined by the mesh. In this paper, we propose an algorithm for fast geodesic distance approximation ...
متن کاملFast and accurate geodesic distance transform by ordered propagation
In this paper we present a new geodesic distance transform that uses a non Euclidean metric suitable for non convex discrete 2D domains. The geodesic metric used is defined as the shortest path length through a set of pixels called Locally Nearest Hidden Pixels, and manages visibility zones using bounding angles. The algorithm is designed using ordered propagation, which makes it extremely effi...
متن کاملFast Distance Computation Using Quadratically Supported Surfaces
We use the class of surfaces with quadratic polynomial support functions in order to define bounding geometric primitives for shortest distance computation. The common normals of two such surfaces can be computed by solving a single polynomial equation of degree six. Based on this observation, we formulate an algorithm for computing the shortest distance between enclosures of two moving or stat...
متن کاملFast Distance Field Computation Using Graphics Hardware
We present an algorithm for fast computation of discretized 3D distance fields using graphics hardware. Given a set of primitives and a distance metric, our algorithm computes the distance field for each slice of a uniform spatial grid by rasterizing the distance functions of the primitives. We compute bounds on the spatial extent of the Voronoi region of each primitive. These bounds are used t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Pattern Analysis and Machine Intelligence
سال: 2020
ISSN: 0162-8828,2160-9292,1939-3539
DOI: 10.1109/tpami.2018.2877961